Linearized polynomial maps over finite fields

نویسنده

  • Joost Berson
چکیده

We consider polynomial maps described by so-called (multivariate) linearized polynomials. These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps without mixed terms over a characteristic zero field, we will only obtain (up to a linear transformation of the variables) triangular maps, which are the most basic examples of polynomial automorphisms. However, over the finite field Fq automorphisms defined by linearized polynomials have (in general) an entirely different structure. Namely, we will show that the linearized polynomial maps over Fq are in one-to-one correspondence with matrices having coefficients in a univariate polynomial ring over Fq. Furthermore, composition of polynomial maps translates to matrix multiplication, implying that invertible linearized polynomial maps correspond to invertible matrices. This alternate description of the linearized polynomial automorphism subgroup leads to the solution of many famous conjectures (most notably, the Jacobian Conjecture) for this kind of polynomials and polynomial maps.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the inverses of some classes of permutations of finite fields

We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field, where one of these is a linearized polynomial. In some cases we are able to explicitly obtain these inverses, thus obtaining the compositional inverse of the ...

متن کامل

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

متن کامل

Gray Images of Constacyclic Codes over some Polynomial Residue Rings

Let  be the quotient ring    where  is the finite field of size   and  is a positive integer. A Gray map  of length  over  is a special map from  to ( . The Gray map   is said to be a ( )-Gray map if the image of any -constacyclic code over    is a -constacyclic code over the field   . In this paper we investigate the existence of   ( )-Gray maps over . In this direction, we find an equivalent ...

متن کامل

Highly degenerate quadratic forms over F2

Let K be a finite extension of F2. We consider quadratic forms written as the trace of xR(x), where R(x) is a linearized polynomial. We determine the K and R(x) where the form has a radical of codimension 2. This is applied to constructing maximal Artin-Schreier curves. Set F = F2 and let K = F2k be an extension of degree k. Let

متن کامل

Some New Permutation Polynomials over Finite Fields

In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of opolynomials, we obtain a class of permutation polynomials of the form G(x) + γTr(H(x)), where G(X) is neither a permutation nor a linearized polynomial. This is an answer to the open problem 1 of Charpin and Kyureghyan in [P. C...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017